Automated Reasoning for Computational Semantics
نویسندگان
چکیده
This paper discusses inference in computational semantics. We argue that state-of-the-art methods in rst-order theorem proving and model building are of direct relevance to inference for natural language processing. We support our claim by discussing the inferen-tial aspects of several higher discourse phenomena and reporting on an experiment where the induced deduction problems are solved by the MathWeb society of theorem proving agents.
منابع مشابه
Deductions with Meaning
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity has a strong impact on the feasibility of any theorem prover for computational semantics. We briefly investigate the different aspects of ambiguity and review some of the solutions that have been proposed to tackle t...
متن کاملQuestions, Arguments, and Natural Language Semantics
Computational models of argumentation can be understood to bridge between human and automated reasoning. Argumentation schemes represent stereotypical, defeasible reasoning patterns. Critical questions are associated with argumentation schemes and are said to attack arguments. The paper highlights several issues with the current understanding of critical questions in argumentation. It provides ...
متن کاملA Case Study in Reasoning about Processes
In this paper, we give a case study to show how a high level semantics of processes can be integrated with the event calculus to reason about complex, continuous processes. We present a formal method to specify the semantics of processes in the event calculus and implement the automated reasoning about processes and continuous change in the logical programming framework. Key-words: Reasoning, P...
متن کاملPlural Semantics for Natural Language Understanding - A Computational Proof-Theoretic Approach
The semantics of natural language plurals poses a number of intricate problems – both from a formal and a computational perspective. In this thesis I investigate problems of representing, disambiguating and reasoning with plurals from a computational perspective. The work defines a computationally suitable representation for important plural constructions, proposes a tractable resolution algori...
متن کاملA Call for Executable Linguistics Research
This paper mirrors my invited talk at PACLIC-22. It describes a call for a renewed emphasis in work on the logical semantics of languages. It lists some of the computational components needed for symbolic interpretations of language, and of automated reasoning within those semantics. It details existing components that meet those needs and provides short examples of how they might work. It also...
متن کامل